Видео с ютуба Theory Of Automata

1. Introduction, Finite Automata, Regular Expressions

Why study theory of computation?

Educational Codeforces Round 180 (Rated for Div. 2) | D. Reachability and Tree

Regular Languages: Deterministic Finite Automaton (DFA)